Regular Enumerations
نویسندگان
چکیده
In the paper we introduce and study regular enumerations for arbitrary recursive ordinals. Several applications of the technique are presented.
منابع مشابه
Uniform regular enumerations
In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalization of a theorem of Ash and a characterization of a class of uniform operators on transfinite sequences of sets of natural numbers.
متن کامل5-chromatic Strongly Regular Graphs
In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...
متن کاملComparison of catalog of (3, g) Hamiltonian bipartite graphs with other known lists
The focus of this paper is on discussion of a catalog of a class of (3, g) graphs for even girth g. A (k, g) graph is a graph with regular degree k and girth g. This catalog is compared with other known lists of (3, g) graphs such as the enumerations of trivalent symmetric graphs and enumerations of trivalent vertex-transitive graphs, to conclude that this catalog has graphs for more orders tha...
متن کاملCounting symmetry classes of dissections of a convex regular polygon
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections between rotationally symmetric dissections and simpler classes of dissections. A number of special cases of these formulas are studied. Consequently, some kno...
متن کاملSome Effectively Infinite Classes of Enumerations
Goncharov, S., A. Yakhnis and V. Yakhnis, Some effectively infinite classes of enumerations, Annals of Pure and Applied Logic 60 (1993) 207-235. This research partially answers the question raised by Goncharov about the size of the class of positive elements of a Roger’s semilattice. We introduce a notion of effective infinity of classes of computable enumerations. Then, using finite injury pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 67 شماره
صفحات -
تاریخ انتشار 2002